Single-commodity robust network design with finite and Hose demand sets
نویسندگان
چکیده
منابع مشابه
Single-commodity robust network design with finite and Hose demand sets
1DEI, University of Bologna, Viale Risorgimento 2, I-40136, Bologna, Italy, {valentina.cacchiani,andrea.lodi}@unibo.it 2Institut für Informatik, Universität zu Köln, Albertus-Magnus-Platz, 50923 Köln, Germany, {mjuenger,schmidt}@informatik.uni-koeln.de 3Department Mathematik, Friedrich-Alexander Universität Erlangen-Nürnberg, Cauerstraße 11, 91058 Erlangen, Germany, [email protected]...
متن کاملSingle source single-commodity stochastic network design
Stochastics affects the optimal design of a network. This paper examines the single-source single-commodity stochastic network design problem. We characterize the optimal designs under demand uncertainty and compare with the deterministic counterparts to outline the basic structural differences. We do this partly as a basis for developing better algorithms than are available today, partly to si...
متن کاملSingle-Commodity Stochastic Network Design with Multiple Sources and Sinks
This paper examines the single-commodity stochastic network design problem with multiple sources and sinks. We characterize the structures of the optimal designs and compare with the deterministic counterparts. We do this primarily to understand what constitutes good robust network designs, but hope that the understanding can also be used to develop better heuristic algorithms than those availa...
متن کاملThe Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
W consider the network loading problem (NLP) under a polyhedral uncertainty description of traffic demands. After giving a compact multicommodity flow formulation of the problem, we state a decomposition property obtained from projecting out the flow variables. This property considerably simplifies the resulting polyhedral analysis and computations by doing away with metric inequalities. Then w...
متن کاملSingle-commodity network design with random edge capacities
This paper examines the single-commodity network design problem with stochastic edge capacities. We characterize the structures of the optimal designs and compare with the deterministic counterparts. We do this partly to understand what constitutes robust network designs, but also to construct a heuristic for the stochastic problem, leading to optimality gaps of about 10%. In our view, that is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2016
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-016-0991-9